A stochastic adding machine and complex dynamics
نویسندگان
چکیده
منابع مشابه
Stochastic functional population dynamics with jumps
In this paper we use a class of stochastic functional Kolmogorov-type model with jumps to describe the evolutions of population dynamics. By constructing a special Lyapunov function, we show that the stochastic functional differential equation associated with our model admits a unique global solution in the positive orthant, and, by the exponential martingale inequality with jumps, we dis...
متن کاملThe Complex Dynamics of a Stochastic Predator-Prey Model
and Applied Analysis 3 From the second equation of model 1.3 , we see that, for t > T , we have dy/dt ≤ ey 1 − bfy/ mb 1 . A standard comparison argument shows that lim sup t→∞ y t ≤ 1 bm bf . 2.2 Thus, we have the following conclusion. Lemma 2.1. Model 1.3 is dissipative. Lemma 2.2. If c < n, then model 1.3 is permanent. Proof. If c < n, from the first equation of model 1.3 , we have dx/dt ≥ a...
متن کاملSpreading dynamics on complex networks: a general stochastic approach.
Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that it...
متن کاملTopological Entropy and Adding Machine Maps
We prove two theorems which extend known results concerning periodic orbits and topological entropy in one-dimensional dynamics. One of these results concerns the adding machine map (also called the odometer map) fα defined on the α-adic adding machine ∆α. We let H(fα) denote the greatest lower bound of the topological entropies of F , taken over all continuous maps F of the interval which cont...
متن کاملthe $n$-ary adding machine and solvable groups
we describe under various conditions abelian subgroups of the automorphism group $mathrm{aut}(t_{n})$ of the regular $n$-ary tree $t_{n}$, which are normalized by the $n$-ary adding machine $tau =(e, dots, e,tau )sigma _{tau }$ where $sigma _{tau }$ is the $n$-cycle $left( 0,1, dots, n-1right) $. as an application, for $n=p$ a prime number, and for $n=4$, we prove that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2000
ISSN: 0951-7715,1361-6544
DOI: 10.1088/0951-7715/13/6/302